Symmetric QR Algorithm with Permutations
نویسنده
چکیده
In this paper, we present the QR Algorithm with Permutations that shows an improved convergence rate compared to the classical QR algorithm. We determine a bound for performance based on best instantaneous convergence, and develop low complexity methods for computing the permutation matrices at every iteration. We use simulations to verify the improvement, and to compare the performance of proposed algorithms to the classical QR algorithm.
منابع مشابه
A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures
We present a new parallel implementation of a divide and conquer algorithm for computing the spectral decomposition of a symmetric tridiagonal matrix on distributed memory architectures. The implementation we develop differs from other implementations in that we use a two-dimensional block cyclic distribution of the data, we use the Löwner theorem approach to compute orthogonal eigenvectors, an...
متن کاملAdding Aggressive Early Deflation to the Restructured Symmetric QR Algorithm
The QR algorithm is an algorithm for computing the spectral decomposition of a symmetric matrix [9]. Despite it’s high accuracy, other methods are often preferred for the symmetric eigenvalue problem due to the QR algorithm’s relatively poor performance [13]. In recent years, new techniques have arisen that dramatically improve its performance. The restructured symmetric QR algorithm, introduce...
متن کاملMatrix shapes invariant under the symmetric QR algorithm
It is shown, which zero patterns of symmetric matrices are preserved under the QR algorithm.
متن کاملComputing the rank revealing factorization of symmetric matrices by the semiseparable reduction
An algorithm for reducing a symmetric dense matrix into a symmetric semiseparable one by orthogonal similarity transformations and an efficient implementation of the QR–method for symmetric semiseparable matrices have been recently proposed. In this paper, exploiting the properties of the latter algorithms, an algorithm for computing the rank revealing factorization of symmetric matrices is con...
متن کاملStructured Backward Error Analysis of Linearized Structured Polynomial Eigenvalue Problems
We start by introducing a new class of structured matrix polynomials, namely, the class of MA-structured matrix polynomials, to provide a common framework for many classes of structured matrix polynomials that are important in applications: the classes of (skew-)symmetric, (anti-)palindromic, and alternating matrix polynomials. Then, we introduce the families of MAstructured strong block minima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1402.5086 شماره
صفحات -
تاریخ انتشار 2014